On growth in minimal totally acyclic complexes
نویسندگان
چکیده
منابع مشابه
Totally Acyclic Complexes over Noetherian Schemes
We define a notion of total acyclicity for complexes of flat quasi-coherent sheaves over a semi-separated noetherian scheme, generalising complete flat resolutions over a ring. By studying these complexes as objects of the pure derived category of flat sheaves we extend several results about totally acyclic complexes of projective modules to schemes; for example, we prove that a scheme is Goren...
متن کاملTotally Real Minimal Tori In
In this paper we show that all totally real superconformal minimal tori in CP 2 correspond with doubly-periodic finite gap solutions of the Tzitzéica equation ωzz̄ = e −2ω − eω. Using the results on the Tzitzéica equation in integrable system theory, we describe explicitly all these tori by Prym-theta functions. Introduction Over the past few years the integrable system approach played an import...
متن کاملOn acyclic systems with minimal Hosoya index
The Hosoya index of a graph is de*ned as the total number of independent edge subsets of the graph. In this note, we characterize the trees with a given size of matching and having minimal and second minimal Hosoya index. ? 2002 Elsevier Science B.V. All rights reserved.
متن کاملAcyclic Formulas and Minimal Unsatisfiability⋆
We call a boolean formula (in CNF) stable acyclic if the associated digraph is free of a certain type of cycles. We show that satisfiability and recognition are polynomial–time solvable problems for stable acyclic formulas. Further, we show that a minimal unsatisfiable formula is stable acyclic if and only if the number of clauses exceeds the number of variables exactly by one (this subclass of...
متن کاملCost-minimal trees in directed acyclic graphs
A number of examples are given where one seeks a minimal-cost tree to span a given subset of the nodes of a connected, directed, acyclic graph (we call such a graph monotonic). Some of these examples require an al~orithm to transform the problem into the form of a minimization problem in a monotonic graph.; this algorithm is also given. Finally, an implicit enumeration algorithm is presented fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Commutative Algebra
سال: 2014
ISSN: 1939-2346
DOI: 10.1216/jca-2014-6-1-17